Scheduling parallel batch jobs in grids with evolutionary metaheuristics
نویسندگان
چکیده
منابع مشابه
Scheduling parallel batch jobs in grids with evolutionary metaheuristics
In this paper we propose an efficient offline job scheduling algorithm working in a grid environment that is based on a relatively new evolutionary metaheuristic called generalized extremal optimization (GEO). We compare our experimental results with those obtained using a very popular evolutionary metaheuristic, the genetic algorithm (GA). The scheduling algorithm implies two-stage scheduling....
متن کاملMultiobjective Evolutionary Algorithms for Scheduling Jobs on Computational Grids
In a computational grid, at time t, the task is to allocate the user defined jobs efficiently by meeting the deadlines and making use of all the available resources. In the past, objectives were combined and the problem is very often simplified to a single objective problem. In this paper, we formulate a novel Evolutionary Multi-Objective (EMO) approach by using the Pareto dominance and the obj...
متن کاملBatch Sampling: Low Overhead Scheduling for Sub-Second Parallel Jobs
Large-scale data analytics frameworks are shifting towards shorter task durations and larger degrees of parallelism to provide low latency. However, scheduling highly parallel jobs that complete in hundreds of milliseconds poses a major scaling challenge for cluster schedulers, which will need to place millions of tasks per second on appropriate nodes while offering millisecondlevel latency and...
متن کاملScheduling Adaptively Parallel Jobs Scheduling Adaptively Parallel Jobs
An adaptively parallel job is one in which the number of processors which can be used without waste changes during execution. When allocating processors to multiple adap-tively parallel jobs, a job scheduler should attempt to be fair|meaning that no job gets fewer processors than another, unless it demands fewer|and eecient|meaning that the scheduler does not waste processors on jobs that do no...
متن کاملBatch scheduling of step deteriorating jobs
In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depending on its waiting time, which is the time between the start of the processing of the batch to which the job belongs and the start of the processing of the job. For job i, if its waiting time is less than a given thr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2014
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-014-0382-0